A note on imputing squares via polynomial combination approach

نویسندگان

چکیده

Abstract The polynomial combination (PC) method, proposed by Vink and Van Buuren, is a hot-deck multiple imputation method for models containing squared terms. yields unbiased regression estimates preserves the quadratic relationships in imputed data both MCAR MAR mechanisms. However, Buuren never studied coverage rate of PC method. This paper investigates nominal 95% confidence intervals improves algorithm to avoid perfect prediction issue. We also compare original improved substantive model compatible fully conditional specification Bartlett et al. elucidate two methods’ characters.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

relaxed stabilization conditions via sum of squares approach for the nonlinear polynomial model

in this paper, stabilization conditions and controller design for a class of nonlinear systems are proposed. the proposed method is based on the nonlinear feedback, quadratic lyapunov function and heuristic slack matrices definition. these slack matrices in null products are derived using the properties of the system dynamics. based on the lyapunov stability theorem and sum of squares (sos) dec...

متن کامل

Computing f(A)b via Least Squares Polynomial Approximations

Given a certain function f , various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly computing the matrix f(A). Such methods were typically developed for a specific function f , a common case being that of the exponential. This paper discusses a procedure based on least squares polynomials that can, in p...

متن کامل

A Note on Property Testing Sum of Squares and Multivariate Polynomial Interpolation

In this paper, we investigate property testing whether or not a degree d multivariate polynomial is a sum of squares or is far from a sum of squares. We show that if we require that the property tester always accepts YES instances and uses random samples, nΩ(d) samples are required, which is not much fewer than it would take to completely determine the polynomial. To prove this lower bound, we ...

متن کامل

On Squares in Polynomial Products

Let f(X) ∈ Z[X] be an irreducible polynomial of degree D ≥ 2 and let N be a sufficiently large positive integer. We estimate the number of positive integers n ≤ N such that the product F (n) = n ∏

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics

سال: 2022

ISSN: ['0943-4062', '1613-9658']

DOI: https://doi.org/10.1007/s00180-022-01194-8